Back to course home
0% completed
Vote For New Content
Microsoft Hard Problems
Regular Expression Matching (hard)
Solution: Regular Expression Matching
First Missing Positive (hard)
Solution: First Missing Positive
Largest Rectangle in Histogram (hard)
Solution: Largest Rectangle in Histogram
Sliding Window Maximum (hard)
Solution: Sliding Window Maximum
Count Unique Characters of All Substrings of a Given String (hard)
Solution: Count Unique Characters of All Substrings of a Given String
Word Ladder (hard)
Solution: Word Ladder
Word Ladder II (hard)
Solution: Word Ladder II
Number of Flowers in Full Bloom (hard)
Solution: Number of Flowers in Full Bloom
Median of Two Sorted Arrays (hard)
Solution: Median of Two Sorted Arrays
Longest Valid Parentheses (hard)
Solution: Longest Valid Parentheses
Buildings With an Ocean View (medium)
Problem Statement
You are given an array heights of size n, representing the heights of n buildings.
The ocean is to the right of these buildings. A building has an ocean view if there are no taller buildings to its right.
The task is to find the indices(0-based) of all such buildings with an ocean view.
Examples
-
Example 1:
- Input:
[4, 3, 2, 1] - Expected Output:
[0, 1, 2, 3] - Justification: Each building is shorter than the one to its left, hence all have an ocean view.
- Input:
-
Example 2:
- Input:
[2, 3, 1, 4] - Expected Output:
[3] - Justification: Building at index 3 is the only one without taller buildings to their right.
- Input:
-
Example 3:
- Input:
[7, 4, 3, 2, 1, 4, 6, 3] - Expected Output:
[0, 6, 7] - Justification: Buildings at indices 0, 6, and 7 are the only ones without taller buildings to their right.
- Input:
Constraints:
- 1 <= heights.length <= 105
- 1 <= heights[i] <= 109
Try it yourself
Try solving this question here:
Java
Saved to Cloud
. . . .
Solution: Number of Islands
Solution: Buildings With an Ocean View
Mark as Completed
On this page
Problem Statement
Examples
Try it yourself